Communicating by compatibility
نویسندگان
چکیده
A bio-inspired language is presented. Its terms are processes enclosed into boxes with typed interaction sites. The main feature of the formalism lays in the fact that the key-lock communication mechanism typically adopted by process calculi is partially relaxed in favour of a paradigm driven by a (parametric) notion of compatibility of interaction types. Two simple modelling examples are reported: one inspired by the immune system, and the other by web services. These examples show that embedding compatibility into the communication paradigm may be helpful for the specification of both biological and information technology scenarios. © 2007 Elsevier Inc. All rights reserved.
منابع مشابه
Compatibility Checking for Asynchronously Communicating Software
Compatibility is a crucial problem that is encountered while constructing new software by reusing and composing existing components. A set of software components is called compatible if their composition preserves certain properties, such as deadlock freedom. However, checking compatibility for systems communicating asynchronously is an undecidable problem, and asynchronous communication is a c...
متن کاملVerifying Business Process Compatibility
We describe a process-algebraic approach to verifying process interactions for business collaboration described in Business Process Modelling Notation. We first overview our process semantics for BPMN in the language of Communicating Sequential Processes; we then use a simple example of business collaboration to demonstrate how our semantic model may be used to verify compatibility between busi...
متن کاملCompatibility Control of Asynchronous Communicating Systems with Unbounded Buffers
The composition of heterogeneous software components is required in many domains to build complex systems. However, such compositions raise mismatches between components such as unspecified messages. Checking compatibility for asynchronously communicating systems with unbounded channels is undecidable. In this paper, we propose a compatibility control approach based on a coverability product, w...
متن کاملA Tool for Choreography-Based Analysis of Message-Passing Software
An appealing characteristic of choreographies is that they provide two complementary views of communicating software: the global and the local views. Communicating finite-state machines (CFSMs) have been proposed as an expressive formalism to specify local views. Global views have been represented with global graphs, that is graphical choreographies (akin to BPMN and UML) suitable to represent ...
متن کاملMultiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
Multiparty session types are a type system that can ensure the safety and liveness of distributed peers via the global specification of their interactions. To construct a global specification from a set of distributed uncontrolled behaviours, this paper explores the problem of fully characterising multiparty session types in terms of communicating automata. We equip global and local session typ...
متن کاملOn Synchronous and Asynchronous Compatibility of Communicating Components
We study interacting components and their compatibility with respect to synchronous and asynchronous composition. The behavior of components is formalized by I/O-transition systems. Synchronous composition is based on simultaneous execution of shared output and input actions of two components while asynchronous composition uses unbounded FIFO-buffers for message transfer. In both contexts we st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Program.
دوره 75 شماره
صفحات -
تاریخ انتشار 2008